Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
نویسندگان
چکیده
منابع مشابه
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
Abstract. We consider a single allocation hub-and-spoke network design problem which allocates each non-hub node to exactly one of given hub nodes so as to minimize the total transportation cost. This paper deals with a case in which the hubs are located in a cycle, which is called a cycle-star hub network design problem. The problem is essentially equivalent to a cycle-metric labeling problem....
متن کاملA constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case
Transportation networks frequently employ hub-and-spoke network architectures to route flows between many origin and destination pairs. In this paper, we deal with a problem, called the single allocation hub-and-spoke network design problem. In the single allocation hub-andspoke network design problem, the goal is to allocate each non-hub node to exactly one of given hub nodes so as to minimize...
متن کاملImproved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40 -approximation algorithm for ∆-Max-ATSP and a 34 -approximation algorithm for Max-3-DCC with polynomial running time. The results are obtained via a new way of applying techniques for computing undirected cycle covers to directed problems.
متن کاملApproximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
This paper deals with a single allocation problem in hub-and-spoke networks. We present a simple deterministic 3-approximation algorithm and randomized 2-approximation algorithm based on a linear relaxation problem and a randomized rounding procedure. We handle the case where the number of hubs is three, which is known to be NP-hard, and present a (5/4)-approximation algorithm. The single alloc...
متن کاملReliable hub-and-spoke network design problems under uncertainty through multi-objective programming
HLP (hub location problem) tries to find locations of hub facilities and assignment of nodes to extended facilities. Hubs are facilities to collect, arrange, and distribute commodities in telecommunication networks, cargo delivery systems, etc. Hubs are very crucial and their inaccessibility impresses on network whole levels. In this paper, first, total reliability of the network is defined bas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2019
ISSN: 1526-1719
DOI: 10.7155/jgaa.00485